Constructions for retransmission permutation arrays

نویسندگان

  • Jeffrey H. Dinitz
  • Maura B. Paterson
  • Douglas R. Stinson
  • Ruizhong Wei
چکیده

Li, Liu, Tan, Viswanathan, and Yang [3] introduced a technique for resolving overlapping channel transmissions that used an interesting new type of combinatorial structure. In connection with this problem, they provided an example of a 4× 4 array having certain desirable properties. We define a class of combinatorial structures, which we term retransmission permutation arrays, that generalise the example that Li et al. provided. We show that these arrays exist for all possible orders. We also define some extensions having additional properties, for which we provide some partial results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Existence of Retransmission Permutation Arrays

We investigate retransmission permutation arrays (RPAs) that are motivated by applications in overlapping channel transmissions. An RPA is an n × n array in which each row is a permutation of {1, . . . , n}, and for 1 6 i 6 n, all n symbols occur in each i × ⌈

متن کامل

Frequency Permutation Arrays

Motivated by recent interest in permutation arrays, we introduce and investigate the more general concept of frequency permutation arrays (FPAs). An FPA of length n = mλ and distance d is a set T of multipermutations on a multiset of m symbols, each repeated with frequency λ, such that the Hamming distance between any distinct x, y ∈ T is at least d. Such arrays have potential applications in p...

متن کامل

New Constructions of Permutation Arrays

A permutation array(permutation code, PA) of length n and distance d, denoted by (n, d) PA, is a set of permutations C from some fixed set of n elements such that the Hamming distance between distinct members x,y ∈ C is at least d. In this correspondence, we present two constructions of PA from fractional polynomials over finite field, and a construction of (n, d) PA from permutation group with...

متن کامل

Constructions for Permutation Codes in Powerline Communications

A permutation array (or code) of length n and distance d is a set G of permutations from some fixed set of n symbols such that the Hamming distance between each distinct x; y [G is at least d. One motivation for coding with permutations is powerline communication. After summarizing known results, it is shown here that certain families of polynomials over finite fields give rise to permutation a...

متن کامل

Constructions of Permutation Arrays for Certain Scheduling Cost Measures

Constructions of permutation arrays are presented that are optimal or nearlyoptimal with respect to two cost measures: the so-called longest-jump measure and the longest-monotone-greedy-subsequence measure. These measures arise in the context of scheduling problems in asynchronous, shared memory, multiprocessor machines. ∗Computer Science Department, Technion — Israel Institute of Technology, H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2012